搜索资源列表
aglorithm
- 问题算法源代码:骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest shortest routes, traveling salesman
huolangdan
- 问题:货郎担问题 实现方法:枚举,回溯,动态规划,分支界限法 -: traveling salesman problem Method : Enumeration, backtracking, dynamic programming, branch and bound
juxingfenzhi
- 这是矩形分支定界算法,采用matlab语言环境-branch and bound algorithm, using Matlab language environment
分枝定界算法
- 分枝定界算法描述,文本形式!-branch-and-bound algorithm descr iption, in text form!
040320131
- 最小圆排列的分支限界法! 用了很好的剪支策略很快的!-smallest circle with a branch and bound method! With a good strategy for cutting sticks soon!
LCbb_TSP
- LC分枝限界法解货郎担—代码-LC Branch and Bound Solving traveling salesman - code
分支限界法_单源最短路径
- 算法设计的分支限界法中的单源最短路径问题的实现,是用VC++编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC + + prepared
分支限界法_批处理作业调度
- 算法设计中的分支限界法中的批处理作业调度问题的实现,是用VC++编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC + + prepared
分支与界法
- 图论中使用分支与界法求解旅行商问题,直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
货郎担分枝限界算法图形
- 货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-traveling salesman Branch and Bound graphics algorithm to solve the traveling salesman problem Branch and Bound algorithm graphic demonstration
dynamic knapsack
- 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparab
翻译材料
- 外观模拟分支定界 分支定界 -appearance simulation branch delimitation of branch-and-bound branch d elimitation of branch-and-bound branch delimitation of branch-and-bound
mazh
- 旅行商问题的算法,采用分枝限界。网上都只有算法描述,没有实现,这里给出了完整实现,并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm descr iption, failed to materialize here is the realization of complete, and packaged as a category.
分支界限
- 用vc编写的解决计算机算法中的分支限界问题,非常经典的代码,请多多指教!-vc prepared with the computer algorithm to solve the branch and bound, very classic code, a great weekend!
yy.rar
- 求用分支限界算法解决旅行商问题的源程序,#include <stdio.h> #include <stdlib.h> #include <math.h> #define TRUE (1) #define FALSE (0) #define MAX_CITIES (10) #define INFINITY (999) #define I INFINITY ,Seeking with branch and bound algorithm t
BNB18
- matlab数学建模工具箱,非线性整数规划模型求解分支定界迭代算法-matlab toolbox of mathematical modeling, nonlinear integer programming model of iterative algorithm branch and bound
fenzhidingjie
- 整数规划,分支定界法,实现1000变量(变量个数可自行设定),只需改变原始数据,就能运行!是比较好的分支分支定界法程序设计-Integer programming, branch and bound method to achieve the 1000 variables (number of variables can be set on their own), simply by changing the original data, you can run! Branch is a bet
zuidatuan.rar
- 使用优先队列分支限界法对单源最短路径问题求解,最小堆作为优先队列的存储结构 使用最小堆来存储活结点,解空间树是一个子集树,Priority queue using branch and bound method of single-source shortest path problem solving, and the youngest heap as a priority queue to use the smallest heap storage structure to store s
intprog
- 分枝定界法程序,解混合整数线性规划《详解MATLAB在最优化计算中的应用》中的分枝定界法程序,稍作了修改-Branch and bound method procedures, the solution mixed integer linear programming, " Detailed MATLAB optimization calculation in the application" in the branch and bound procedure, slightl
shortest-way-java.rar
- 分支限界法 单源最短路径问题的 JAVA实现 3个源文件,Branch and bound method single-source shortest path problem JAVA realization of 3 source files